Upper chromatic number of Steiner triple and quadruple systems
نویسندگان
چکیده
منابع مشابه
Upper chromatic number of Steiner triple and quadruple systems
The upper chromatic number χ(H) of a set system H is the maximum number of colours that can be assigned to the elements of the underlying set of H in such a way that each H ∈ H contains a monochromatic pair of elements. We prove that a Steiner Triple System of order v ≤ 2 − 1 has an upper chromatic number which is at most k. This bound is the best possible, and the extremal configurations attai...
متن کامل5-Chromatic Steiner Triple Systems
We show that, up to an automorphism, there is a unique independent set in PG(5,2) that meet every hyperplane in 4 points or more. Using this result, we show that PG(5,2) is a 5-chromatic STS. Moreover, we construct a 5-chromatic STS(v) for every admissible v ≥ 127.
متن کاملAn upper bound on the number of Steiner triple systems
Richard Wilson conjectured in 1974 the following asymptotic formula for the number of n-vertex Steiner triple systems: STS(n) = ( (1 + o(1)) n e2 )n2 6 . Our main result is that STS(n) ≤ ( (1 + o(1)) n e2 )n2 6 . The proof is based on the entropy method. As a prelude to this proof we consider the number F (n) of 1factorizations of the complete graph on n vertices. Using the KahnLovász theorem i...
متن کاملStrict colorings of Steiner triple and quadruple systems: a survey
The paper surveys problems, results and methods concerning the coloring of Steiner Triple and Quadruple Systems viewed as mixed hypergraphs. In this setting, two types of conditions are considered: each block of the Steiner system in question has to contain (i) a monochromatic pair of vertices, or, more restrictively, (ii) a triple of vertices that meets precisely two color classes.
متن کاملStar chromatic numbers of hypergraphs and partial Steiner triple systems
The concept of star chromatic number of a graph, introduced by Vince (1988) is a natural generalization of the chromatic number of a graph. This concept was studied from a pure combinatorial point of view by Bondy and Hell (1990). In this paper we introduce strong and weak star chromatic numbers of uniform hypergraphs and study their basic properties. In particular, we focus on partial Steiner ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1997
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(97)80332-9